Optimal Wire Sizing and Bu er Insertion for Low Power and a Generalized Delay Model

نویسندگان

  • John Lillis
  • Chung-Kuan Cheng
  • Ting-Ting Y. Lin
چکیده

We present eecient, optimal algorithms for timing optimization by discrete wire sizing and buuer insertion. Our algorithms are able to minimize a cost function subject to given timing constraints; we focus on minimization of dynamic power dissipation, but the algorithm is also easily adaptable to, for example, area minimization. In addition, the algorithm eeciently computes the complete, optimal power-delay tradeoo curve for added design exibility. An extension of our basic algorithm accommodates a generalized delay model which takes into account the eeect of signal slew on buuer delay which can contribute substantially to overall delay. This work represents the most eecient algorithms to date for the discrete wire sizing problem and for wire sizing in conjunction with buuer insertion. It is also, to the best of our knowledge, the rst work on buuer insertion to incorporate signal slew into the delay model while guaranteeing optimality. The eeectiveness of these methods is demonstrated experimentally.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Wire Sizing and Buuer Insertion for Low Power and a Generalized Delay Model

We present eecient, optimal algorithms for timing optimization by discrete wire sizing and buuer insertion. Our algorithms are able to minimize a cost function subject to given timing constraints; we focus on minimization of dynamic power dissipation, but the algorithm is also easily adaptable to, for example, area minimization. In addition, the algorithm eeciently computes the complete, optima...

متن کامل

A Polynomial Time Optimal Algorithm for Simultaneous Bu er and Wire Sizing

An interconnect joining a source and a sink is divided into xed length uniform width wire segments and some adjacent segments have bu ers in between The problem we considered is to simultaneously size the bu ers and the segments so that the Elmore delay from the source to the sink is minimized Previously no polynomial time al gorithm for the problem has been reported in literature In this paper...

متن کامل

A New Approach to Simultaneous Bu er Insertion and Wire Sizing Chris

In this paper, we present a completely new approach to the problem of delay minimization by simultaneous bu er insertion and wire sizing for a wire. We show that the problem can be formulated as a convex quadratic program, which is known to be solvable in polynomial time. Nevertheless, we explore some special properties of our problem and derive an optimal and very e cient algorithm to solve th...

متن کامل

A New Approach to Simultaneous Bu er Insertion and Wire Sizing

In this paper, we present a completely new approach to the problem of delay minimization by simultaneous bu er insertion and wire sizing for a wire. We show that the problem can be formulated as a convex quadratic program, which is known to be solvable in polynomial time. Nevertheless, we explore some special properties of our problem and derive an optimal and very e cient algorithm to solve th...

متن کامل

Bu ered Steiner Tree Construction with Wire Sizing for Interconnect Layout Optimization

This paper presents an e cient algorithm for bu ered Steiner tree construction with wire sizing. Given a source and n sinks of a signal net, with given positions and a required arrival time associated with each sink, the algorithm nds a Steiner tree with bu er insertion and wire sizing so that the required arrival time (or timing slack) at the source is maximized. The unique contribution of our...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995